The Job-search Problem with Incomplete Information
نویسندگان
چکیده
منابع مشابه
Fuzzy Greedy Search and Job-Shop Problem
This paper describes a new metaheuristic for combinatorial optimisation problems with specific reference to the jobshop scheduling problem (JSP). A fuzzy greedy search algorithm (FGSA) which is a combination of a genetic algorithm (GA) and a greedy randomised adaptive search procedure (GRASP) is considered to solve the problem. The effectiveness and efficiency of the proposed hybrid method will...
متن کاملGenetic Algorithm with Local Search for Job Shop Scheduling Problem
The job shop scheduling problem (JSSP) is a well-known difficult combinatorial optimization problem. This paper presents a hybrid genetic algorithm for the JSSP with the objective of minimizing makespan. A new generation alternation model of genetic algorithm for JSSP is designed. Every pair of randomly selected parents must pass either crossover or mutation, which are deployed in parallel. In ...
متن کاملA Birandom Job Search Problem with Risk Tolerance
This paper considers a novel class of birandom job search problem, in which the job offers are sampled by the job searcher from a finite job set with equivalent probability and their wages are characterized as independent but maybe not identically nonnegative random variables. The job searcher knows the job offer’s wage distribution when he samples the job offer. Since the offered wage is a ran...
متن کاملPlanning with Incomplete Information as Heuristic Search in Belief Space
The [ornntlation of planning as heuristk: search with heuristics derived from problem representations ]nas turned out to be a fruitful approach for cla..,...ical planning. In this paper, we, pur.,,ue a sinnilar idea in Ihe context pLa.nning with incomplete inh)rmation. Planning with incomphit.e iTnforntalion can be formulatvd as a pmbh’nt of search in &.liqf space, where b(l&f stat~ can be ell ...
متن کاملRendezvous-evasion search in two boxes with incomplete information
An agent (who may or may not want to be found) is located in one of two boxes. At time 0 suppose that he is in box B. With probability p he wishes to be found, in which case he has been asked to stay in box B. With probability 1−p he tries to evade the searcher, in which case he may move between boxes A and B. The searcher looks into one of the boxes at times 1, 2, 3, . . .. Between each search...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2015
ISSN: 1877-0509
DOI: 10.1016/j.procs.2015.07.025